"AIMEZ-VOUS IONESCO?" E "THE TRAVELING COMPANION"

Offered Load Analysis for Staffing: e-Companion

It is natural to ask: What are the exciting research problems that remain? Our goal here is to provide a partial answer by describing how the ideas in the main paper, Whitt (2013), have been extended, thus revealing the current state of the art. We briefly discuss six extensions: (i) more general arrival and service processes, (ii) the modified offered load approximation, (iii) a theoretical ex...

E - Companion of “ On the Measurement of Economic Tail Risk

Proof. Without loss of generality, we only need to prove for the case s= 1, as ρ satisfies Axioms A1-A5 if and only if 1 s ρ satisfies Axioms A1-A5 (with s= 1 in Axiom A3). The “only if” part. First, we show that (2) holds for any X ∈L∞(Ω,F , P ). Define the set function ν(E) := ρ(1E),E ∈F . Then, it follows from Axiom A2 and A3 that ν is monotonic, ν(∅) = 0, and ν(Ω) = 1. ForM ≥ 1, define LM :...

Asynchronous Rendez-vous in Distributed Logic Programming

In this paper the semantics of the communication mechanism of the distributed logic programming language DLP is studied. DLP combines logic programming with object oriented features and parallelism. For an abstract subset of DLP both an operational and denotational semantics is given. The language DLP supports active objects, method call by rendezvous and moreover (distributed) backtracking ove...

Adnosco : gérez les données que vous diffusez !

Resurrecting Ada's Rendez-Vous in Java

Java is a programming language designed with concurrency in mind from its inception. However, the synchronization mechanism provided is a restricted version of Hoare’s Monitors, being too low level for most applications. In this paper we propose a high level synchronization mechanism for Java, based on Ada’s Rendez-Vous, adapting the notation and semantics to Java. The result is a nice and read...